Distributional Impacts of Country-of-Origin Labeling in the U.S. Meat Industry

Concerns about the negative effects of U.S. meat and livestock imports on domestic livestock prices have increased interest in country-of origin labeling (COOL) legislation. An equilibrium displacement model is used to estimate short-run and long-run changes in equilibrium prices and quantities of meat and livestock in the beef, pork, and poultry sectors resulting from the implementation of COOL. Retail beef and pork demand would have to experience a one-time, permanent increase of 4.05% and 4.45%, respectively, so that feeder cattle and hog producers do not lose producer surplus over a 10-year period.country-of-origin labeling, equilibrium displacement model, producer surplus, Agribusiness,

Congestion-gradient driven transport on complex networks

We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging from random diffusion to rigid congestion-gradient driven flow. Each node can be either source or destination for particles and all nodes have the same routing capacity, which are features of ad-hoc wireless networks. It is shown that the transport capacity increases when a small amount of congestion awareness is present in the routing rules, and that it then decreases as the routing rules become too rigid when the flow becomes strictly congestion-gradient driven. Therefore, an optimum value of the congestion awareness exists in the routing rules. It is also shown that, in the limit of a large number of nodes, networks using routing based on local information jam at any nonzero load. Finally, we study the correlation between congestion at node level and a betweenness centrality measure.Comment: 11 pages, 8 figure

Commentary : Donepezil enhances understanding of degraded speech in Alzheimer's disease

Non peer reviewe

Optimal routing on complex networks

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By using the resulting routing table, a network can sustain significantly higher traffic without jamming than in the case of traditional shortest path routing.Comment: 4 pages, 5 figure

WHOLESALE DEMAND FOR USDA QUALITY GRADED BOXED BEEF AND EFFECTS OF SEASONALITY

This study estimates wholesale demand for pork, chicken, and quality differentiated beef. We estimate meat retailer own- and cross-price demand elasticities for USDA Choice and Select boxed beef. Results indicate that meat retailers have more elastic demand for lower quality graded beef. Retail beef price has a strong positive relationship with Choice and Select boxed beef demand, and a strong negative relationship with wholesale pork and chicken demand. Seasonal analysis reveals demand for both beef quality grades becomes highly price inelastic during the summer months. The two beef quality grades are substitutes during the winter; however, Select beef is not a substitute for Choice beef in the spring and summer.Demand and Price Analysis,

Transport optimization on complex networks

We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the maximum node betweenness with as little path lengthening as possible. We show that by using this optimal routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing. A formula is proved that allows quick computation of the average number of hops along the path and of the average travel times once the betweennesses of the nodes are computed. Using this formula, we show that routing optimization preserves the small-world character exhibited by networks under shortest path routing, and that it significantly reduces the average travel time on congested networks with only a negligible increase in the average travel time at low loads. Finally, we study the correlation between the weights of the links in the case of optimal routing and the betweennesses of the nodes connected by them.Comment: 19 pages, 7 figure

Corrigendum: Failing to get the gist of what's being said: background noise impairs higher-order cognitive processing.

[This corrects the article on p. 548 in vol. 6, PMID: 26052289.]

Joint entropy of continuously differentiable ultrasonic waveforms

This study is based on an extension of the concept of joint entropy of two random variables to continuous functions, such as backscattered ultrasound. For two continuous random variables, X and Y, the joint probability density p(x,y) is ordinarily a continuous function of x and y that takes on values in a two dimensional region of the real plane. However, in the case where X=f(t) and Y=g(t) are both continuously differentiable functions, X and Y are concentrated exclusively on a curve, γ(t)=(f(t),g(t)), in the x,y plane. This concentration can only be represented using a mathematically singular object such as a (Schwartz) distribution. Its use for imaging requires a coarse-graining operation, which is described in this study. Subsequently, removal of the coarse-graining parameter is accomplished using the ergodic theorem. The resulting expression for joint entropy is applied to several data sets, showing the utility of the concept for both materials characterization and detection of targeted liquid nanoparticle ultrasonic contrast agents. In all cases, the sensitivity of these techniques matches or exceeds, sometimes by a factor of two, that demonstrated in previous studies that employed signal energy or alternate entropic quantities